The Meet-continuity of L -semilattices
نویسندگان
چکیده
منابع مشابه
Coloring Of Meet-Semilattices
Given a commutative semigroup S with 0, where 0 is the unique singleton ideal, we associate a simple graph Γ(S), whose vertices are labeled with the nonzero elements in S. Two vertices in Γ(S) are adjacent if and only if the corresponding elements multiply to 0. The inverse problem, i.e., given an arbitrary simple graph, whether or not it can be associated to some commutative semigroup, has pro...
متن کاملMeet-continuity on $L$-directed Complete Posets
In this paper, the definition of meet-continuity on $L$-directedcomplete posets (for short, $L$-dcpos) is introduced. As ageneralization of meet-continuity on crisp dcpos, meet-continuity on$L$-dcpos, based on the generalized Scott topology, ischaracterized. In particular, it is shown that every continuous$L$-dcpo is meet-continuous and $L$-continuous retracts ofmeet-continuous $L$-dcpos are al...
متن کاملmeet-continuity on $l$-directed complete posets
in this paper, the definition of meet-continuity on $l$-directedcomplete posets (for short, $l$-dcpos) is introduced. as ageneralization of meet-continuity on crisp dcpos, meet-continuity on$l$-dcpos, based on the generalized scott topology, ischaracterized. in particular, it is shown that every continuous$l$-dcpo is meet-continuous and $l$-continuous retracts ofmeet-continuous $l$-dcpos are al...
متن کاملLevel Rings Arising from Meet-distributive Meet-semilattices
The Alexander dual of an arbitrary meet-semilattice is described explicitly. Meet-distributive meet-semilattices whose Alexander dual is level are characterized.
متن کاملPriestley Style Duality for Distributive Meet-semilattices
We generalize Priestley duality for distributive lattices to a duality for distributive meet-semilattices. On the one hand, our generalized Priestley spaces are easier to work with than Celani’s DS-spaces, and are similar to Hansoul’s Priestley structures. On the other hand, our generalized Priestley morphisms are similar to Celani’s meet-relations and are more general than Hansoul’s morphisms....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2017
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2017.08.010